#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time    : 2020/8/13 17:21
# @USER    : Shengji He
# @File    : RemoveDuplicatesSortedArr2.py
# @Software: PyCharm
# @Version  : Python-
# @TASK:
from typing import List


class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        """
        Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at
        most twice and return the new length.

        Do not allocate extra space for another array, you must do this by modifying the input array
        in-place with O(1) extra memory.

        Example 1:

            Given nums = [1,1,1,2,2,3],

            Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2
            and 3 respectively.

            It doesn't matter what you leave beyond the returned length.
        Example 2:

            Given nums = [0,0,1,1,1,1,2,3,3],

            Your function should return length = 7, with the first seven elements of nums being modified
            to 0, 0, 1, 1, 2, 3 and 3 respectively.

            It doesn't matter what values are set beyond the returned length.

        :param nums:
        :return:
        """
        count = 1
        i = 1
        while i < len(nums):
            if nums[i] == nums[i - 1]:
                count += 1
                if count > 2:
                    nums.pop(i)
                    i -= 1
            else:
                count = 1
            i += 1

        return len(nums)


if __name__ == '__main__':
    S = Solution()
    nums = [1, 1, 1, 2, 2, 3]
    print((S.removeDuplicates(nums)))
    print('done')
